#include <iostream>
#include <cmath>
#include <algorithm>
#define MAXN 105
using namespace std;
int N, H, R, T;
const double g = 10.0;
double y[MAXN];
void solve();
int main() {
    cin >> N >> H >> R >> T;
    solve();
}

double calc(int TT) {
    if (TT < 0) return H;
    double t = sqrt(2 * H / g);
    int k = int (TT / t);
    if (k % 2 == 0) {
        double d = TT - k * t;
        return H - g * d * d / 2;
    } else {
        double d = k * t + t - TT;
        return H - g * d * d / 2;
    }

}

void solve() {
    for (int i = 0; i < N; i++) {
        y[i] = calc(T - i);
    }
    sort(y, y + N);
    for (int i = 0; i < N; i++) {
        printf("%.2f%c", y[i] + 2 * R * i / 100.0, i + 1 == N ? '\n' : ' ');
    }
}